- binary interval
- мат.двоичный интервал
English-Russian scientific dictionary. 2008.
binary interval
Смотреть что такое "binary interval" в других словарях:
Interval arithmetic — Interval arithmetic, also called interval mathematics , interval analysis , and interval computation , is a method in mathematics. It has been developed by mathematicians since the 1950s and 1960s as an approach to putting bounds on rounding… … Wikipedia
Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Interval (mathematics) — This article is about intervals of real numbers. For intervals in general mathematics, see Partially ordered set. For other uses, see Interval. In mathematics, a (real) interval is a set of real numbers with the property that any number that lies … Wikipedia
Binary logarithm — NOTOC In mathematics, the binary logarithm (log2 n ) is the logarithm for base 2. It is the inverse function of n mapsto 2^n. The binary logarithm is often used in computer science and information theory (where it is frequently written lg n , or… … Wikipedia
Timeline of binary prefixes — This article presents a terminology timeline of binary prefixes.1940s; 1943 1944:*J.W. Tukey coins the word bit as an abbreviation of binary digit . [http://catb.org/ esr/jargon/html/B/bit.html The Jargon File (version 4.4.7)] ] ; 1948:*… … Wikipedia
Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful … Wikipedia
Arithmetic coding — is a method for lossless data compression. Normally, a string of characters such as the words hello there is represented using a fixed number of bits per character, as in the ASCII code. Like Huffman coding, arithmetic coding is a form of… … Wikipedia
eclipse — eclipser, n. /i klips /, n., v., eclipsed, eclipsing. n. 1. Astron. a. the obscuration of the light of the moon by the intervention of the earth between it and the sun (lunar eclipse) or the obscuration of the light of the sun by the intervention … Universalium
star — starless, adj. /stahr/, n., adj., v., starred, starring. n. 1. any of the heavenly bodies, except the moon, appearing as fixed luminous points in the sky at night. 2. Astron. any of the large, self luminous, heavenly bodies, as the sun, Polaris,… … Universalium
Comparison of relational database management systems — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations … Wikipedia
